On graphic elementary lifts of graphic matroids
نویسندگان
چکیده
An elementary lift of a binary matroid M that arises from coextension can easily be obtained by applying the splitting operation on M. This graphic may not produce matroid. We give method to determine forbidden minors for class matroids such any set k elements is again Using this method, we obtain k=2,3,4. One compute k≥5. As consequence, whose all lifts via coextensions are also graphic. There six minors.
منابع مشابه
Single Commodity-Flow Algorithms for Lifts of Graphic and Co-graphic Matroids
Consider a binary matroid M given by its matrix representation. We show that if M is a lift of a graphic or a cographic matroid, then in polynomial time we can either solve the single commodity flow problem for M or find an obstruction for which the Max-Flow MinCut relation does not hold. The key tool is an algorithmic version of Lehman’s Theorem for the set covering polyhedron.
متن کاملGraphic Matroids
Matroid theory was first formalized in 1935 by Whitney [5] who introduced the notion as an attempt to study the properties of vector spaces in an abstract manner. Since then, matroids have proven to have numerous applications in a wide variety of fields including combinatorics and graph theory. Today we will briefly survey matroid representation and then discuss some problems in matroid optimiz...
متن کاملOn cographic matroids and signed-graphic matroids
We prove that a connected cographic matroid of a graph G is the bias matroid of a signed graph Σ iff G imbeds in the projective plane. In the case that G is nonplanar, we also show that Σ must be the projective-planar dual signed graph of an actual imbedding of G in the projective plane. As a corollary we get that, if G1, . . . , G29 denote the 29 nonseparable forbidden minors for projective-pl...
متن کاملBranchwidth of graphic matroids
Answering a question of Geelen, Gerards, Robertson and Whittle [2], we prove that the branchwidth of a bridgeless graph is equal to the branchwidth of its cycle matroid. Our proof is based on branch-decompositions
متن کاملAlmost-Graphic Matroids
A nongraphic matroid M is said to be almost-graphic if, for all elements e, either M\e or M/e is graphic. We determine completely the class of almost-graphic matroids, thereby answering a question posed by Oxley in his book “Matroid Theory.” A nonregular matroid is said to be almost-regular if, for all elements e, either M\e or M/e is regular. An element e for which both M\e and M/e are regular...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 2022
ISSN: ['1872-681X', '0012-365X']
DOI: https://doi.org/10.1016/j.disc.2022.113014